# 抖码算法，让算法学习变得简单有趣
# 作者：老汤


# 初始化元音字符
from typing import List

yuan_yin = set(['a', 'e', 'i', 'o', 'u'])


def count_kai_yin_jie(word):
    res = 0
    if len(word) < 4:
        return res
    for i in range(len(word) - 3):
        c1, c2 = word[i], word[i + 1]
        c3, c4 = word[i + 2], word[i + 3]
        # 相对开音节构成的结构为辅音 + 元音 (aeiou) + 辅音 (r 除外) + e
        if (not c1 in yuan_yin
                and c2 in yuan_yin
                and not c3 in yuan_yin and c3 != 'r'
                and c4 == 'e'):
            res += 1
    return res


def reverse(s: List[str]):
    left, right = 0, len(s) - 1
    while left <= right:
        # 如果遇到非字母的话，则直接返回原字符串，不进行反转
        if not s[left].isalpha() or not s[right].isalpha():
            return s
        s[left], s[right] = s[right], s[left]
        left, right = left + 1, right - 1
    return "".join(s)


words = str(input()).split(" ")
# 反转每个单词
for i in range(len(words)):
    words[i] = reverse(list(words[i]))
# 统计每个单词中的相对开音节的个数，累加得到最终结果
res = 0
for i in range(len(words)):
    res += count_kai_yin_jie(words[i])
print(res)